A Low-Complexity, High-Speed Reed-Solomon Decoder
نویسنده
چکیده
This paper presents a low-complexity, high-speed RS(255,239) decoder architecture using Modified Euclidean (ME) algorithm for the high-speed fiber optic communication systems. The RS decoder features a low-complexity key equation solver using a novel pipelined recursive ME algorithm block. Pipelining allows inputs to be received at very high fiber optic rates and outputs to be delivered at correspondingly high rates with minimum delay. The recursive structure enables us to implement the low-complexity ME algorithm block. The low-complexity, high-speed RS decoder has been designed and implemented with the 0.13-μm CMOS technology in a supply voltage of 1.1 V. It is suggested that proposed RS decoder operates at a clock rate of 770 MHz and has a throughput of 6.16 Gb/s.
منابع مشابه
Pipelined recursive modified Euclidean algorithm block for low-complexity, high-speed Reed–Solomon decoder
A novel pipelined recursive modified Euclidean (ME) algorithm block for the low-complexity, high-speed Reed–Solomon (RS) decoder is presented. The deeply pipelined recursive structure enables implementation of a significantly low-complexity ME algorithm block with much improved clock frequency. The low-complexity, high-speed RS decoder using the pipelined recursive ME algorithm block has been i...
متن کاملAlgorithm-Based Low-Power/High-Speed Reed–Solomon Decoder Design
With the spread of Reed–Solomon (RS) codes to portable wireless applications, low-power RS decoder design has become important. This paper discusses how the Berlekamp Massey Decoding algorithm can be modified and mapped to obtain a low-power architecture. In addition, architecture level modifications that speed-up the syndrome and error computations are proposed. Then the VLSI architecture and ...
متن کاملLow Power/High Speed design of a Reed Solomon Decoder
OF T H E PAPER With the spread of Reed Solomon codes t o portable applications, low power RS decoder design has become important. This paper discusses how the Berlekamp Massey Decoding algorithm can be modified in order t o obtain a low power architecture. In addition, modifications thut speed-up the syndrome and error computations are suggested. T h e n the VLSI design of a low power/high spee...
متن کاملA High-Speed Low-Complexity Time-Multiplexing Reed-Solomon-Based FEC Architecture for Optical Communications
A high-speed low-complexity time-multiplexing ReedSolomon-based forward error correction architecture based on the pipelined truncated inversionless Berlekamp-Massey algorithm is presented in this paper. The proposed architecture has very high speed and very low hardware complexity compared with conventional ReedSolomon-based forward error correction architectures. Hardware complexity is improv...
متن کاملIterative Multivariate Interpolation for Low Complexity Reed - Solomon Codes
The algebraic soft-decoding (ASD) of Reed– Solomon (RS) codes provides significant coding gain over hard-decision decoding with polynomial complexity. In order to reduce the complexity in this paper, high-throughput interpolator architecture for soft-decision decoding of Reed– Solomon (RS) codes based on low-complexity chase (LCC) decoding is presented. An efficiency is low, in terms of areadel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003